Cayley graphs and symmetric 4-polytopes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cayley Graphs and Symmetric 4-Polytopes

Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral abstract 4-polytope P . Here we study the Cayley graph C on a natural group generated by polarities of P , show that C covers G in a readily computable way and construct C as a voltage graph over G. We then examine such symmetric graphs for several interesting families of polytopes of type {p, q,...

متن کامل

Cayley graphs and symmetric interconnection networks

These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...

متن کامل

Cayley graphs - Cayley nets

It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.

متن کامل

Stacked 4-polytopes with Ball Packable Graphs

After investigating the ball-packability of some small graphs, we give a full characterisation, in terms of forbidden induced subgraphs, for the stacked 4-polytopes whose 1-skeletons can be realised by the tangency relations of a ball packing.

متن کامل

On the diameter of cayley graphs of the symmetric group

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group Sym(n), the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ars Mathematica Contemporanea

سال: 2008

ISSN: 1855-3974,1855-3966

DOI: 10.26493/1855-3974.79.919